Two-Person Zero-Sum Stochastic Games with Semicontinuous Payoff
نویسندگان
چکیده
Consider a two-person zero-sum stochastic game with Borel state space S, compact metric action sets A, B and law of motion q such that the integral under q of every bounded Borel measurable function depends measurably on the initial state s and continuously on the actions (a,b) of the players. Suppose the payoff is a bounded function f of the infinite history of states and actions such that f is measurable for the product of the Borel sigma-fields of the coordinate spaces and is lower semi continuous for the product of the discrete topologies on the coordinate spaces. Then the game has a value and player II has a subgame perfect optimal strategy. Mots clés : Jeux stochastiques, perfection en sous jeux, ensembles Boréliens.
منابع مشابه
A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملTwo-person Zero-sum Linear Quadratic Stochastic Differential Games by a Hilbert Space Method
An open-loop two-person zero-sum linear quadratic (LQ for short) stochastic differential game is considered. The controls for both players are allowed to appear in both the drift and diffusion of the state equation, the weighting matrices in the payoff/cost functional are not assumed to be definite/nonsingular, and the cross-terms between two controls are allowed to appear. A forward-backward s...
متن کاملCanonical forms of two-person zero-sum limit average payoff stochastic games
We consider two-person zero-sum stochastic games with perfect information and, for each k ∈ Z+, introduce a new payoff function, called the k-total reward. For k = 0 and 1 they are the so called mean and total rewards, respectively. For all k, we prove solvability of the considered games in pure stationary strategies, and show that the uniformly optimal strategies for the discounted mean payoff...
متن کاملA lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games
It is shown that the discount factor needed to solve an undiscounted mean payoff stochastic game to optimality is exponentially close to 1, even in games with a single random node and polynomially bounded rewards and transition probabilities.
متن کاملA Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V,E), with local rewards r : E → Z, and three types of positions: black VB , white VW , and random VR forming a partition of V . It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, even when |VR| = 0. In fact, a pseudo-polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Dynamic Games and Applications
دوره 3 شماره
صفحات -
تاریخ انتشار 2013